Tropical convexity over max-min semiring
نویسندگان
چکیده
This is a survey on an analogue of tropical convexity developed over the max-min semiring, starting with the descriptions of max-min segments, semispaces, hyperplanes and an account of separation and non-separation results based on semispaces. There are some new results. In particular, we give new “colorful” extensions of the max-min Carathéodory theorem. In the end of the paper, we list some consequences of the topological Radon and Tverberg theorems (like Helly and Centerpoint theorems), valid over a more general class of max-T semirings, where multiplication is a triangular norm.
منابع مشابه
Tropical linear algebra with the Łukasiewicz T-norm
The max-Łukasiewicz semiring is defined as the unit interval [0, 1] equipped with the arithmetics “a + b” = max(a, b) and “ab” = max(0, a + b− 1). Linear algebra over this semiring can be developed in the usual way. We observe that any problem of the max-Łukasiewicz linear algebra can be equivalently formulated as a problem of the tropical (max-plus) linear algebra. Based on this equivalence, w...
متن کاملTropical Arithmetic and Tropical Matrix Algebra
This paper introduces a new structure of commutative semiring, generalizing the tropical semiring, and having an arithmetic that modifies the standard tropical operations, i.e. summation and maximum. Although our framework is combinatorial, notions of regularity and invertibility arise naturally for matrices over this semiring; we show that a tropical matrix is invertible if and only if it is r...
متن کاملAn optimal pre-determinization algorithm for weighted transducers
We present a general algorithm, pre-determinization, that makes an arbitrary weighted transducer over the tropical semiring or an arbitrary unambiguous weighted transducer over a cancellative commutative semiring determinizable by inserting in it transitions labeled with special symbols. After determinization, the special symbols can be removed or replaced with -transitions. The resulting trans...
متن کاملBetter Complexity Bounds for Cost Register Automata
Cost register automata (CRAs) are one-way finite automata whose transitions have the side effect that a register is set to the result of applying a state-dependent semiring operation to a pair of registers. Here it is shown that CRAs over the tropical semiring (N∪{∞},min,+) can simulate polynomial time computation, proving along the way that a naturally defined width-k circuit value problem ove...
متن کاملBetter Complexity Bounds for Cost Register Machines
Cost register automata (CRAs) are one-way finite automata whose transitions have the side effect that a register is set to the result of applying a state-dependent semiring operation to a pair of registers. Here it is shown that CRAs over the tropical semiring (N∪{∞},min,+) can simulate polynomial time computation, proving along the way that a naturally defined width-k circuit value problem ove...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013